On $K$-semimetric spaces

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interval semimetric spaces for approximate distances

In accordance with the ideas of Interval Analysis, a notion of interval-valued semimetric space is proposed. Also, the possibility of applying the resulting theory to some chapters of Computer Science is examined.

متن کامل

Groups Acting on Semimetric Spaces and Quasi-isometries of Monoids

We study groups acting by length-preserving transformations on spaces equipped with asymmetric, partially-defined distance functions. We introduce a natural notion of quasi-isometry for such spaces and exhibit an extension of the Švarc-Milnor Lemma to this setting. Among the most natural examples of these spaces are finitely generated monoids and semigroups and their Cayley and Schützenberger g...

متن کامل

compactifications and function spaces on weighted semigruops

chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...

15 صفحه اول

Strongly k-spaces

‎In this paper‎, ‎we introduce the notion of strongly $k-$spaces (with the weak (=finest) pre-topology generated by their strongly compact subsets)‎. ‎We characterize the strongly $k-$spaces and investigate the relationships between preclosedness‎, ‎locally strongly compactness‎, ‎pre-first countableness and being strongly $k-$space.

متن کامل

Optimizing over Semimetric Polytopes

called the triangle inequalities. The paper deals with the problem of finding efficient algorithms to optimize a linear function over such a polytope. We briefly mention two reasons to seek for an efficient way to optimize a linear function over M(G). 1. The polytope M(G), for |V | > 4, properly contains the cut polytope associated with G (see, e.g., [5] for the details). Thus, if an edge cost ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1979

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1979-0512073-5